结构/直角切割网格下时域有限体积法在计算电磁中的应用研究

 采用有限体积法直接求解时域麦克斯韦方程组，研究了二维圆柱、翼型和三维球体、立方体、双球体等典型完全导电目标的电磁散射问题。空间离散使用近似黎曼解构建网格通量，并针对二维结构网格、三维自适应直角切割网格分别给出重构方法，时间方向采用二步龙格库塔法。计算与理论、实验或文献结果符合良好。     

三维直角叉树切割网格Euler方程自适应算法

基于叉树数据结构，实现了一种用于三维直角叉树切割网格的自适应算法，包括对几何外,形以及对流场计算的自适应网格加密技术。在初始网格的生成过程中，根据相邻网格的物面法向向量间的差值，进行针对外形的自适应网格加密；在流场计算中，根据相邻网格间选定物理量梯度的变化，进行针对流场的自适应网格加密。详细地描述了三维直角叉树切割网格的生成过程，以及以任意网格的切割细分算法。在自适应过程中，分别采用了八叉树和全叉树的数据结构，八叉树是基本的数据结构，而全叉树的采用，使网格具有了各向异性的特征，从而大大的减少了自适应网格的数量。采用中心有限体积法，求解Euler方程，并运用上术方法，完成了对外形和流场的逢适应网格加密算法，获得了较好的数值计算结果，证明了自适应算法的正确性，体现了直角叉树切割网格自适应技术的有效性和实用性。     

用非结构直角网格和欧拉方程计算飞机绕流

 采用八叉树结构 ,生成复杂外形绕流计算的非结构直角网格。物面附近用投影方法 ,使网格贴体。并将Jameson的有限体积法推广用于这种网格的欧拉方程计算。对歼击机模型的绕流计算表明 ,网格生成的机时花费很少 ,总体质量好 ,因而欧拉方程解算的收敛质量也好。     

三维非结构网格的生成及优化

叙述了一种新的生成三维非结构网格的Delaunay方法,该方法能够高效地生成优质四面体网格。由于采用了局部剖分的方法来保证边界的完整性,因而不需要添加新的节点到原始表面三角形中。该方法在四面体外接球的球心处插入新的节点,在插入全部内点后,采用删除边、边/面交换、网格光顺等方法对生成的网格进行了优化,基本能删除质量差的四面体。     

在非结构网格上求解非线性航空声学问题的高精度有限体积法

介绍了有限体积数值方法,该方法适用于在任意非结构网格上求解线性和非线性的航空声学问题.本方法基于角点-中心的多参数格式,可在笛卡尔网格上达到六阶精度,对于可能的不连续性采用了自适应耗散.通过一系列算例研究了该方法的特性,结果表明:在模拟谐振型管中的噪声抑制中,所提出的方法是很有效的.     

含运动边界二维多体干扰流场的数值模拟

本文采用二阶精度Godonov扩展方法求解非定常：Euler方程，以基于格心的自适应非结构网格的显式有限体积法为基础，空间和时间都是二阶精度，使用HLLC近似黎曼解的方法计算网格单元边界处的守恒量通量，对作俯仰振动的NACA0012翼型绕流及激波管中运动、静止圆柱的流场进行了数值模拟，并对数值模拟的结果进行了分析，为进一步对含多体分离流场进行数值模拟打下了基础。     

Automatic differentiation based discrete adjoint method for aerodynamic design optimization on unstructured meshes

A systematic methodology for formulating, implementing, solving and verifying discrete adjoint of the compressible Reynolds-averaged Navier-Stokes (RANS) equations for aerodynamic design optimization on unstructured meshes is proposed. First, a general adjoint formulation is con-structed for the entire optimization problem, including parameterization, mesh deformation, flow solution and computation of the objective function, which is followed by detailed formulations of matrix-vector products arising in the adjoint model. According to this formulation, procedural components of implementing the required matrix-vector products are generated by means of auto-matic differentiation (AD) in a structured and modular manner. Furthermore, a duality-preserving iterative algorithm is employed to solve flow adjoint equations arising in the adjoint model, ensur-ing identical convergence rates for the tangent and the adjoint models. A three-step strategy is adopted to verify the adjoint computation. The proposed method has several remarkable features:the use of AD techniques avoids tedious and error-prone manual derivation and programming;duality is strictly preserved so that consistent and highly accurate discrete sensitivities can be obtained; and comparable efficiency to hand-coded implementation can be achieved. Upon the cur-rent discrete adjoint method, a gradient-based optimization framework has been developed and applied to a drag reduction problem.     

三角网格面自动铺丝定角度路径规划算法

研究三角网格曲面上的路径规划问题,以局部测地线为补充,提出了改进的定角度初始路径规划算法。该算法避免了传统参数化求解过程的无解和多解情况,尤其适用于曲率变化较大的复杂曲面和拼接曲面。采用等距覆盖算法来获得均匀的满铺路径,并分别提出基于路径样条线末端延伸和芯模曲面整体延拓的两种边界处理思路,以解决偏移路径无法到达曲面边界的问题。以某机翼模型为算例对上述算法进行验证,利用计算机辅助三维交互应用(Computer aided three-dimensional interactive application,CATIA)的逆向工程模块实现了完整的算法可视化,建立了三维建模软件与路径规划算法的系统关系。验证表明本文提出的算法可靠、系统、适应性强,具有工程应用价值。     

A fast and automatic full-potential finite volume solver on Cartesian grids for unconventional configurations

To meet the requirements of fast and automatic computation of subsonic and transonic aerodynamics in aircraft conceptual design,a novel finite volume solver for full potential flows on adaptive Cartesian grids is developed in this paper.Cartesian grids with geometric adaptation are firstly generated automatically with boundary cells processed by cell-cutting and cell-merging algo rithms.The nonlinear full potential equation is discretized by a finite volume scheme on these Cartesian grids and iteratively solved in an implicit fashion with a generalized minimum residual (GMRES) algorithm.During computation,solution-based mesh adaptation is also applied so as to capture flow features more accurately.An improved ghost-cell method is proposed to implement the non-penetration wall boundary condition where the velocity-potential of a ghost cell is modified by an analytic method instead.According to the characteristics of the Cartesian grids,the Kutta condition is applied by specially computing the gradients on Kutta-faces without directly assigning the potential jump to cells adjacent wake faces,which can significantly improve the solution con verging speed.The feasibility and accuracy of the proposed method are validated by several typical cases of sub/transonic flows around an ONERA M6 wing,a DLR-F4 wing-body,and an unconventional figuration of a blended wing body (BWB).The validation cases demonstrate a fast convergence with fully automatic grid treatment and computation,and the results suggest its capacity in application for aircraft conceptual design.     

可压缩粘性流动笛卡尔网格虚拟单元方法研究

以二维高雷诺数可压缩粘性流动问题为背景,提出了一种全新的笛卡尔网格虚拟单元方法。基于壁面函数基本假设,构造了壁面函数-虚拟单元方法(WF-GCM),用于定义湍流壁面边界条件。引入参考点的概念计算虚拟单元上的基本变量与湍流变量值,定义了"非贴体"笛卡尔网格下的湍流壁面边界条件,并通过壁面函数模型修正近壁面单元与界面单元。基于自适应笛卡尔网格体系,采用发展的具有二阶精度的格心格式有限体积求解器,数值模拟了跨音速RAE2822翼型绕流问题与超音速圆柱绕流问题,计算结果与实验值吻合良好,显示了WF-GCM对高雷诺数可压缩粘性问题是有效的。